Cellular automata with sparse communication
نویسندگان
چکیده
منابع مشابه
Cellular Automata with Sparse Communication
We investigate cellular automata whose internal inter-cell communication is bounded. The communication is quantitatively measured by the number of uses of the links between cells. Bounds on the sum of all communications of a computation as well as bounds on the maximal number of communications that may appear between each two cells are considered. It is shown that even the weakest non-trivial d...
متن کاملBounded Languages Meet Cellular Automata with Sparse Communication
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by bounding the number of allowed uses of the links between cells. Moreover, we consider the devices as acceptors for bounded languages in order to ex...
متن کاملCellular automata and communication complexity
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on communication complexity theory and, as a by-product, we provide (yet another) classification of cellular automata.
متن کاملTraced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the central cell will ever reach a particular state. We present some links with classical dynamical concepts, and give the asymptotic communication complexity of many elementary cellular automata.
متن کاملFast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity
A d-dimensional cellular automaton with sequential input mode is a d-dimensional grid of interconnected interacting finite automata. The distinguished automaton at the origin, the communication cell, is connected to the outside world and fetches the input sequentially. Often in the literature this model is referred to as iterative array. We investigate d-dimensional iterative arrays and one-dim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.05.024